Harmonic Analysis Invariants for Infinite Graphs Via Operators and Algorithms

نویسندگان

چکیده

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators Hilbert space, geometry, boundary constructions, and spectral invariants. focus particular classes graphs, including such weighted graphs which arise electrical network models, as well diagrammatic graph representations. further stress some direct parallels between our one hand, and, other, specific areas potential theory, probability, functions, theory. The limit finite to infinite, local global, can be used various applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for Distinguishing Invariants of Infinite Graphs

We consider infinite graphs. The distinguishing number D(G) of a graph G is the minimum number of colours in a vertex colouring of G that is preserved only by the trivial automorphism. An analogous invariant for edge colourings is called the distinguishing index, denoted by D′(G). We prove that D′(G) 6 D(G) + 1. For proper colourings, we study relevant invariants called the distinguishing chrom...

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

Geodesics and Bounded Harmonic Functions on Infinite Planar Graphs

It is shown there that an infinite connected planar graph with a uniform upper bound on vertex degree and rapidly decreasing Green's function (relative to the simple random walk) has infinitely many pairwise finitelyintersecting geodesic rays starting at each vertex. We then demonstrate the existence of nonconstant bounded harmonic functions on the graph. Let g be an infinite, simple, connected...

متن کامل

Boundary systems and self-adjoint operators on infinite metric graphs

We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-) self-adjoint and unitary operators by means of self-orthogonal subspaces. By orthogonality preserving mappings, these characterizations can be transferred to abstract boundary value spaces of (skew-)symmetric operators. Introducing the notion of boun...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Fourier Analysis and Applications

سال: 2021

ISSN: ['1531-5851', '1069-5869']

DOI: https://doi.org/10.1007/s00041-021-09827-0